Browsing by Subject "Smoothing networks"
Now showing items 1-3 of 3
-
Article
A combinatorial treatment of balancing networks
(1996)Balancing networks, originally introduced by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348-358, May 1991), represent a new class of distributed, low-contention data structures ...
-
Conference Object
The impact of randomization in smoothing networks
(2008)We revisit smoothing networks[3], which are made up of balancers and wires. Tokens arrive arbitrarily on w input wires and propagate asynchronously through the network
-
Article
The impact of randomization in smoothing networks
(2010)We revisit randomized smoothing networks (Herlihy and Tirthapura in J Parallel Distrib Comput 66(5):626-632, 2006), which are made up of balancers and wires. We assume that balancers are oriented independently and uniformly ...